Undecidable Problems: a Sampler
نویسنده
چکیده
After discussing two senses in which the notion of undecidability is used, we present a survey of undecidable decision problems arising in various branches of mathematics.
منابع مشابه
Decidable and Undecidable Problems in Matrix Theory
This work is a survey on decidable and undecidable problems in matrix theory. The problems studied are simply formulated, however most of them are undecidable. The method to prove undecidabilities is the one found by Paterson [Pat] in 1970 to prove that the mortality of nitely generated matrix monoids is undecidable. This method is based on the undecidability of the Post Correspondence Problem....
متن کاملUndecidable Problems About Timed Automata
We solve some decision problems for timed automata which were raised by S. Tripakis in [Tri04] and by E. Asarin in [Asa04]. In particular, we show that one cannot decide whether a given timed automaton is determinizable or whether the complement of a timed regular language is timed regular. We show that the problem of the minimization of the number of clocks of a timed automaton is undecidable....
متن کاملUndecidable problems for propositional calculi with implication
In this article, we deal with propositional calculi over a signature containing the classical implication → with the rules of modus ponens and substitution. For these calculi we consider few recognizing problems such as recognizing derivations, extensions, completeness, and axiomatizations. The main result of this paper is to prove that the problem of recognizing extensions is undecidable for e...
متن کاملThe Generalized Gibbs Sampler and the Neighborhood Sampler
The Generalized Gibbs Sampler (GGS) is a recently proposed Markov chain Monte Carlo (MCMC) technique that is particularly useful for sampling from distributions defined on spaces in which the dimension varies from point to point or in which points are not easily defined in terms of co-ordinates. Such spaces arise in problems involving model selection and model averaging and in a number of inter...
متن کاملSome Decision Problems Related To
The problem of deciding whether a monoid that is given through a nite presentation is a regular monoid as well as two closely related decision problems are considered. Since these problems are undecidable in general, they are investigated for certain restricted classes of nite presentations. Some new decidability results as well as some new undecidability results are obtained, which show that f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012